Enumeration on graph mosaics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of mosaics

Mosaics are orbits of partitions arising from music theoretical investigations. Various theorems from the field of “enumeration under finite group actions” are applied for enumerating mosaics. In other words, it is demonstrated how to enumerate G-orbits of partitions of given size, block-type or stabilizer-type.

متن کامل

Generating Classic Mosaics with Graph Cuts

Classic mosaic is an old and durable art form. Generating artificial classic mosaics from digital images is an interesting problem that has attracted attention in recent years. Previous approaches to mosaic generation are largely based on heuristics, and therefore it is harder to analyse, predict and improve their performance. In addition, previous methods have a number of disadvantages, such a...

متن کامل

Simulating Classic Mosaics with Graph Cuts

Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasing, a mosaic should satisfy the following constraints: tiles should be non-overlapping, tiles should align to the perceptually important edges in the underlying digital image, and orientation of the neighbouring tiles ...

متن کامل

Graph Compositions I: Basic Enumeration

The idea of graph compositions generalizes both ordinary compositions of positive integers and partitions of finite sets. In this paper we develop formulas, generating functions, and recurrence relations for composition counting functions for several families of graphs.

متن کامل

Enumeration of Forests in a Graph

The enumeration of forests of different orders in a graph is carried out by a procedure that involves formal sums and certain annihilation operators on the space of such sums. The results here extend the well-known matrix-tree theorem to the general case of forests. Introduction. In pursuing the enumeration of connected spanning subgraphs [1], each containing a fixed number of cycles, for a pla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Knot Theory and Its Ramifications

سال: 2017

ISSN: 0218-2165,1793-6527

DOI: 10.1142/s0218216517500328